Formal Verification of Spacecraft Control Programs Using a Metalanguage for State Transformers
نویسندگان
چکیده
Verification of functional correctness of control programs is an essential task for the development of space electronics; it is difficult and time-consuming and typically outweighs design and programming tasks in terms of development hours. We present a verification approach designed to help spacecraft engineers reduce the effort required for formal verification of low-level control programs executed on custom hardware. The approach uses a metalanguage to describe the semantics of a program as a state transformer, which can be compiled to multiple targets for testing, formal verification, and code generation. The metalanguage itself is embedded in a strongly-typed host language (Haskell), providing a way to prove program properties at the type level, which can shorten the feedback loop and further increase the productivity of engineers. The verification approach is demonstrated on an industrial case study. We present REDFIN, a processing core used in space missions, and its formal semantics expressed using the proposed metalanguage, followed by a detailed example of verification of a simple control program.
منابع مشابه
Relational Refinement Types for Higher-Order Shape Transformers (Invited Talk)
Understanding, discovering, and proving useful properties of sophisticated data structures are central problems in program verification. A particularly challenging exercise for shape analyses involves reasoning about sophisticated shape transformers that preserve the shape of a data structure (e.g., the data structure skeleton is always maintained as a balanced tree) or the relationship among v...
متن کاملSymbolic Modeling Approach in Verification and Testing
The paper outlines a symbolic modeling approach developed in Glushkov Institute of Cybernetics and applied in verification and model-based testing. This method is the result of 10 years of experience in a large amount of industrial projects in different subject domains. The models in this approach are presented as UCM (Use Case Maps) notation composed with basic protocols formal language. Symbo...
متن کاملVerification and Validation of AI Systems . . .
concrete domain of values and operations in a programming language to an abstract domain, typically with values ordered in a lattice and abstracted operations defined through lattice operations (e.g., meet and join). Abstract interpretation is often applied through fixed mappings for various types of analysis used in compiler optimization, such as dead code detection. In this ongoing research, ...
متن کاملReachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کاملElf: a Language for Logic Deenition and Veriied Metaprogramming
We describe Elf, a metalanguage for proof manipulation environments that are independent of any particular logical system. Elf is intended for meta-programs such as theorem provers, proof transformers, or type inference programs for programming languages with complex type systems. Elf uniies logic deenition (in the style of LF, the Edinburgh Logical Framework) with logic programming (in the sty...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1802.01738 شماره
صفحات -
تاریخ انتشار 2018